Good trellises for IC implementation of Viterbi decoders for linear block codes

m This paper investigates trellis structures of linear block codes for the integrated circuit (lC) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper-bound on the number of parallel and structurally identical (or isomorphic) subtreilises in a proper trellis for a code without exceeding the _um state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called add-compare-select (ACS)-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (intercolmections within the IC). The effect of five parameters namely: 1) effective computational complexity; 2) complexity of the ACS-circuit; 3) traceback complexity; 4) ACSconnectivity; and 5) branch complexity of a trellis diagram on the very large scale integration (VLSI) complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a nonmiuimui trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered. Index TermsmACS-array architecture, trellis diagram, Viterbi decoder.